-
1 optimal search tree
English-Russian electronics dictionary > optimal search tree
-
2 optimal binary search tree
оптимальное двоичное дерево поиска
—
[ http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > optimal binary search tree
-
3 optimal binary search tree
Вычислительная техника: оптимальное бинарное дерево поиска, оптимальное двоичное дерево поискаУниверсальный англо-русский словарь > optimal binary search tree
-
4 tree
1) вчт древовидная схема; древовидный дешифратор2) дерево (напр. графа) || древовидный3) крист. дендрит•- tree of given weight
- tree of objectives
- tree of statements
- abstract syntax tree
- adaptive tree
- Adel'son-Vel'ski-Landis tree
- Aronshine tree
- AVL tree
- B-tree
- balanced tree
- bifurcation tree
- binary tree
- binary searchtree
- Boolean tree
- branching tree
- Cartesian tree
- Cayley tree
- choice tree
- classification tree
- classification and regression tree
- clock tree
- cluster tree
- co-tree
- code tree
- command tree
- complement tree
- complete code tree
- computation tree
- conference tree
- countable tree
- decision tree
- decomposition tree
- deduction tree
- derivation tree
- edge-rooted tree
- equipotential tree
- existence trie tree
- fault tree
- Feigenbaum tree
- Fibonacci tree
- finite tree
- fractal tree
- game tree
- generation tree
- graph tree
- hardware tree
- hierarchical tree
- homeomorphically irreducible tree
- Husimi tree
- hypothesis search tree
- inference tree
- information tree
- labeled tree
- language tree
- lexicographic tree
- loaded fractal tree
- logical tree
- minimal tree
- minimal length tree
- multibranch tree
- multiway tree
- normal tree
- optimal tree
- optimal merge tree
- optimal search tree
- ordered tree
- oriented tree
- outcome tree
- parse tree
- parsing tree
- patricia tree
- planar tree
- plane tree
- priority tree
- priority search tree
- probability tree
- production tree
- proper tree
- proof tree
- radix tree
- randomized binary tree
- RB tree
- recursive tree
- red-black tree
- response tree
- rooted tree
- search tree
- selection tree
- shortest tree
- shortest-distance tree
- signed tree
- spanning tree
- specific tree
- subject tree
- subspanning tree
- suffix tree
- symmetric tree
- syntax tree
- ternary tree
- ternary search tree
- threaded tree
- topological tree
- transition tree
- trie tree
- two-color tree
- two-dimensional tree
- two-level tree
- unlabeled tree
- weighted tree -
5 tree
1) дерево, древо || засаживать деревьями2) древовидная схема; древовидная структура3) т. граф. дерево4) pl дендритные образования на катоде ( при электроосаждении металлов)- mixed star tree - plane tree- set tree -
6 search
1) поиск || искать, проводить поиск2) просмотр, перебор вариантов || просматривать, перебирать варианты3) исследование, изучение, обследование || исследовать, изучать, обследовать•- stepwise searchto search out — разыскать, обнаружить
-
7 algorithm
- ad hoc algorithm
- adaptive algorithm
- aim algorithm
- algorithm for path connections
- automatic assessment algorithm
- back-propagation algorithm
- banker's algorithm
- best-route algorithm
- bicomponent algorithm
- bipartitioning algorithm
- bisection algorithm
- branch-bound algorithm
- branching algorithm
- cascading algorithm
- chain algorithm
- channel router algorithm
- coarse-to-fine algorithm
- column sweep algorithm
- combinatorial algorithm
- computational algorithm
- computing algorithm
- conservative algorithm
- control algorithm
- convergent algorithm
- curve-fitting algorithm
- cutting-plane algorithm
- D-algorithm
- decision algorithm
- decoding algorithm
- demand-paging algorithm
- deterministic algorithm
- digit-by-digit algorithm
- divide-and-conquer algorithm
- double-sweep algorithm
- draphics algorithm
- drawing algorithm
- DSP algorithm
- dual algorithm
- durable algorithm
- earliest-deadline-first algorithm
- edge-based algorithm
- event-scheduling algorithm
- exchange algorithm
- fault-handling algorithm
- fine-to-coarse algorithm
- fixed-stealing algorithm
- fixed-step-size algorithm
- flow-synthesis algorithm
- forward-looking algorithm
- generalized algorithm
- genetic algorithm
- Goto algorithm
- graph algorithm
- graph traversal algorithm
- greedy algorithm
- grid expansion algorithm
- hardware algorithm
- heuristic algorithm
- Hightower algorithm
- incorrect algorithm
- inference-based algorithm
- inferencing algorithm
- instruction issue algorithm
- integer algorithm
- integrated query optimization algorithm
- iteration algorithm
- iterative algorithm
- layout algorithm
- layout copmaction algorithm
- leaky bucket algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-expansion algorithm
- Lee-type algorithm
- levelization algorithm
- linear expansion algorithm
- line-placing algorithm
- line-probe algorithm
- logical algorithm
- mathematically based algorithm
- mathematically intensive algorithm
- maximum matching algorithm
- mesh algorithm - minimum path-length algorithm
- modeling algorithm
- multikey algorithm
- multipass algorithm
- nested algorithm
- network algorithm
- normal algorithm
- no-wait algorithm
- operative algorithm
- optimal assignment algorithm
- optimal cutting algorithm
- ordering algorithm
- page-replacement algorithm
- paging algorithm
- parallel algorithm
- partitioning algorithm
- path-tracing algorithm
- pipeline algorithm
- pitch algorithm
- placement algorithm
- prediction algorithm
- primal-dual algorithm
- primary algorithm
- problem algorithm
- procrastination algorithm
- public-key algorithm
- quorum-based algorithm
- random search algorithm
- recognition algorithm
- recursive algorithm
- relaxation algorithm
- replicate algorithm
- robust algorithm
- round-robin algorithm
- routing algorithm
- scanline algorithm
- scheduling algorithm
- sequential algorithm
- shortest path algorithm
- shrinking algorithm
- simplex algorithm
- simulated annealing algorithm
- software algorithm
- spanning tree algorithm
- speech generation algorithm
- speed-enhancing algorithm
- square rooting algorithm
- steepest ascent algorithm
- systolic algorithm
- testing algorithm
- text-to-speech algorithm
- threshold decoding algorithm
- timetable scheduling algorithm
- trace back algorithm
- translation algorithm
- transportation algorithm
- tree-search algorithm
- two-dimensional placement algorithm
- two-list algorithm
- type-inferencing algorithm
- unconstrained minimization algorithm
- universal algorithm
- variable-stealing algorithm
- Vintr algorithm
- VLSI algorithm
- write-back algorithmEnglish-Russian dictionary of computer science and programming > algorithm
-
8 method
метод; процедура; способ- antithetic variate method - average ordinate method - average range method - binary search method - conjugate directions method - conjugate gradient method - control chart method - conventional milling method - correlation function method - decision function method - differential control method - Feynman diagram method - first approximation method - gradient projection method - iterative method - large sample method - large sieve method - least-squares regression method - less than fully efficient method - linearly implicit method - method of adjoint gradient - method of algebraic addition - method of alternating directions - method of balanced blocks - method of complex numbers - method of confidence intervals - method of conformal mappings - method of conjugate directions - method of conjugate gradients - method of cyclic descent - method of detached coefficients - method of disjunction of cases - method of divided differences - method of electrical images - method of elimination of quantifiers - method of empty ball - method of extreme values - method of false position - method of feasible directions - method of finite differences - method of first approximation - method of first entrance - method of fitting constants - method of fixed points - method of full enumeration - method of generating functions - method of geometric exhaustion - method of indefinite coefficients - method of infinite descent - method of interval bisection - method of least absolute values - method of least distance - method of least likelihood - method of maximum likelihood - method of means and standard deviations - method of medians and extreme values - method of minimal change - method of minimal variance - method of mirror reflections - method of moving frame - method of multiple comparison - method of orthogonal projections - method of paired associates - method of paired comparisons - method of phase integrals - method of projecting cones - method of proportional parts - method of rotating factors - method of semantic tableaux - method of separation of variables - method of simulaneous displacements - method of stationary phase - method of statistical differentials - method of statistical inference - method of steep variations - method of steepest ascent - method of stochastic approximation - method of straightforward iteration - method of successive displacements - method of successive divisions - method of successive elimination - method of transfinite induction - method of unweighted means - method of variable differences - method of variation of parameters - method of weighted residuals - optimum method - parallel tangents method - precision method - random walk method - recursive method - reduced gradient method - reflected wave method - relative method of measurement - sampling method by variables - statistical sampling method - steepest descent method - time average method -
9 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem
См. также в других словарях:
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
Self-balancing binary search tree — In computer science, a self balancing binary search tree or height balanced binary search tree is a binary search tree that attempts to keep its height , or the number of levels of nodes beneath the root, as small as possible at all times,… … Wikipedia
Search algorithm — In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer… … Wikipedia
Tree rearrangement — Tree rearrangements are used in heuristic algorithms devoted to searching for an optimal tree structure. They can be applied to any set of data that are naturally arranged into a tree, but have most applications in computational phylogenetics,… … Wikipedia
R-tree — R trees are tree data structures that are similar to B trees, but are used for spatial access methods i.e., for indexing multi dimensional information; for example, the (X, Y) coordinates of geographical data. A common real world usage for an R… … Wikipedia
Decision tree learning — This article is about decision trees in machine learning. For the use of the term in decision analysis, see Decision tree. Decision tree learning, used in statistics, data mining and machine learning, uses a decision tree as a predictive model… … Wikipedia
Interval tree — In computer science, an interval tree, also called a segment tree or segtree, is an ordered tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is… … Wikipedia
Suffix tree — In computer science, a suffix tree (also called suffix trie, PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many… … Wikipedia
Iterative deepening depth-first search — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Segment tree — In computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows querying which of the stored segments contain a given point. It is, in principle, a static structure; that is, its content cannot be… … Wikipedia
Index (search engine) — Search engine indexing collects, parses, and stores data to facilitate fast and accurate information retrieval. Index design incorporates interdisciplinary concepts from linguistics, cognitive psychology, mathematics, informatics, physics, and… … Wikipedia
